Cauchy Density-Based Algorithm for VANETs Clustering in 3D Road Environments

نویسندگان

چکیده

Vehicular ad hoc networks (VANETs) are emerging to serve various types of applications for serving smart cities and intelligent transportation systems. There several challenging factors ensuring reliable stable VANETs communications. clustering is essential functionality routing protocols in enable VANETs. Clustering algorithms operate decentralized mode, which requires incorporating additional stages before deciding the decisions might create suboptimality due local nature approach. In addition, architecture road environment can cause confusing decisions. This problem becomes more evolving clusters general 3D particular. paper tackles using a centralized model based on developed Cauchy density model. The development has included traffic generation model, mobility generating driving behavior, an algorithm enabling modeling curvature adjacency list that defines road’s points define straight-line segment. vector uses Cauchy-based adding vehicles their respective clusters. For evaluation, conducted scenarios three locations with considered, comparison benchmarks shows superiority our over improvement percentage 1%, 10%, 3% average cluster head duration, member efficiency respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Mobility-Based Clustering Algorithm for VANETs

Due to the development of communication and other related technologies, vehicular ad hoc networks (VANET) have been experiencing a rapid development in the recent years. Clustering has been proved an effective way to manage the wireless resource, control the network topology, and simplify the routing in VANETs. However, it is difficult to construct stable clusters in VANETs, because of the high...

متن کامل

Improvement of density-based clustering algorithm using modifying the density definitions and input parameter

Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically i...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

A New Aggregate Local Mobility (ALM) Clustering Algorithm for VANETs

We present a beacon-based clustering algorithm aimed at prolonging the cluster lifetime in VANETs. We use a new aggregate local mobility criterion to decide upon cluster re-organisation. The scheme incorporates a contention method to avoid triggering frequent re-organisations when two clusterheads encounter each other for a short period of time. Simulation results show a significant improvement...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3187698